Target Enumeration via Integration over Planar Sensor Networks

We solve the problem of counting the total number of observable targets (persons, vehicles, etc.) in a region based on local counts performed by sensors which measure only the number of targets nearby and neither their identities nor any positional information. This theory is robust and accommodates ad hoc sensor networks and mobile robot sensors alike. Comments Reprinted from: Robert Ghrist, Yuliy Baryshnikov. Target Enumeration via Integration over Planar Sensor Networks. Proceedings of Robotics: Science and Systems IV, Zurich, Switzerland, June 25-27, 2008. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/grasp_papers/4 Target enumeration via integration over planar sensor networks Yuliy Baryshnikov Mathematical and Algorithmic Sciences Bell Laboratories Murray Hill NJ, USA Robert Ghrist Department of Mathematics and Coordinated Sciences Laboratory University of Illinois Urbana IL, USA Abstract— We solve the problem of counting the total number of observable targets (e.g., persons, vehicles, etc.) in a region based on local counts performed by sensors which measure only the number of targets nearby and neither their identities nor any positional information. This theory is robust and accommodates ad hoc sensor networks and mobile robot sensors alike. We solve the problem of counting the total number of observable targets (e.g., persons, vehicles, etc.) in a region based on local counts performed by sensors which measure only the number of targets nearby and neither their identities nor any positional information. This theory is robust and accommodates ad hoc sensor networks and mobile robot sensors alike.